Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
نویسندگان
چکیده
Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.
منابع مشابه
Traffic-Splitting Networks Operating under Alpha-fair Sharing Policies and Balanced Fairness
We consider a data network in which, besides classes of users that use specific routes, one class of users can split its traffic over several routes. We consider load balancing at the packetlevel, implying that traffic of this class of users can be divided among several routes at the same time. Assuming that load balancing is based on an alpha-fair sharing policy, we show that the network has m...
متن کاملSteady state approximations of limited processor sharing queues in heavy traffic
We investigate steady state properties of limited processor sharing queues in heavy traffic. Our analysis builds on previously obtained process limit theorems, and requires the interchange of steady state and heavy traffic limits, which are established by a coupling argument. The limit theorems yield explicit approximations of the steady state queue length and response time distribution in heav...
متن کاملFluid and Heavy Traffic Diffusion Limits for a Generalized Processor Sharing Model By
Under fairly general assumptions on the arrival and service time processes, we prove fluid and heavy traffic limit theorems for the unfinished work, queue length, sojourn time and waiting time processes associated with a single station multiclass generalized processor sharing model. The fluid limit of the unfinished work process is characterized by the Skorokhod map associated with a Skorokhod ...
متن کاملGeneralised Processor Sharing Networks Fed by Heavy-tailed Traffic Flows
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteris...
متن کاملAn analytical packet/flow-level modelling approach for wireless LANs with Quality-of-Service support
We present an analytical packet/flow-level modelling approach for the performance analysis of IEEE 802.11e WLAN, where we explicitly take into account QoS differentiation mechanisms based on minimum contention window size values and Arbitration InterFrame Space (AIFS) values, as included in the Enhanced Distributed Channel Access (EDCA) protocol of the 802.11e standard. We first enhance the pac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 59 شماره
صفحات -
تاریخ انتشار 2011